Finding k-cuts within Twice the Optimal
نویسندگان
چکیده
Two simple approximation algorithms for the minimum k-cut problem are presented. Each algorithm finds a k cut having weight within a factor of (2 2/k) of the optimal. One algorithm is particularly efficient-it requires a total of only n maximum flow computations for finding a set of near-optimal k cuts, one for each value of k between 2 and n.
منابع مشابه
Approximating k
Given an undirected, edge-weighted connected graph, the k-cut problem is to partition the vertex set into k non-empty connected components so as to minimize the total weight of edges whose end points are in different components. We present a combinatorial polynomial-time 2-approximation algorithm for the k-cut problem. We use a Lagrangean relaxation (also suggested by Barahona [F. Barahona, On ...
متن کاملFinding separator cuts in planar graphs within twice the optimal
A factor 2 approximation algorithm for the problem of finding a minimum-cost bbalanced cut in planar graphs is presented, for b ≤ 1 3 . We assume that the vertex weights are given in unary; for the case of binary vertex weights, a pseudoapproximation algorithm is presented. This problem is of considerable practical significance, especially in VLSI design. The natural algorithm for this problem ...
متن کاملFinding separator cuts in planar graphs within twice the optimal - Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium on
Building on the works of Reo [9, 101 and Park and Phillips [8], we present a factor 2 approximation algorithm for the problem of finding a minimum cost bbalanced cut in planar graphs, for b 5 5 , if the vertex weights are given in unary (using scaling, a psuedo-approximation algorithm is also presented for the case of binary vertex weights). This problem is of considerable practical significanc...
متن کاملAn NC Algorithm for Minimum Cuts
We show that the minimum-cut problem for weighted undirected graphs can be solved in NC using three separate and independently interesting results. The first is an (m/n)-processor NC algorithm for finding a (2 + ǫ)-approximation to the minimum cut. The second is a randomized reduction from the minimum-cut problem to the problem of obtaining a (2 + ǫ)-approximation to the minimum cut. This reduc...
متن کاملImproved Univariate Microaggregation for Integer Values
Privacy issues during data publishing is an increasing concern of involved entities. The problem is addressed in the field of statistical disclosure control with the aim of producing protected datasets that are also useful for interested end users such as government agencies and research communities. The problem of producing useful protected datasets is addressed in multiple computational priva...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Comput.
دوره 24 شماره
صفحات -
تاریخ انتشار 1991